Concept Lattices Constrained by Attribute Dependencies

نویسندگان

  • Radim Belohlávek
  • Vladimir Sklenar
  • Jiri Zacpal
چکیده

The input data to formal concept analysis consist of a collection of objects, a collection of attributes, and a table describing a relationship between objects and attributes (so-called formal context). Very often, there is an additional information about the objects and/or attributes available. In the analysis of the data, the additional information should be taken into account. We consider a particular form of the additional information. The information is in the form of particular attribute dependencies. The primary interpretation of the dependencies is to express a kind of relative importance of attributes. We introduce the notion of a formal concept compatible with the attribute dependencies. The main gain of considering only compatible formal concepts and disregarding formal concepts which are not compatible is the reduction of the number of resulting formal concepts. This leads to a more comprehensible structure of formal concepts (clusters) extracted from the input data. We illustrate our approach by examples.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inferring dependencies from relations: a conceptual clustering approach

In this paper we consider two related types of data dependencies that can hold in a relation: conjunctive implication rules between attribute-value pairs, and functional dependencies. We present a conceptual clustering approach that can be used, with some small modifications, for inferring a cover for both types of dependencies. The approach consists of two steps. First, a particular clustered ...

متن کامل

Fuzzy attribute logic over complete residuated lattices

We present a logic, called fuzzy attribute logic, for reasoning about formulas describing particular attribute dependencies. The formulas are of a form A ⇒ B where A and B are collections of attributes. Our formulas can be interpreted in two ways. First, in data tables with entries containing degrees to which objects (table rows) have attributes (table columns). Second, in database tables where...

متن کامل

FUZZY CONCEPTUAL KNOWLEDGE PROCESSINGChristoph

We introduce fuzziness to conceptual knowledge processing by using linguistic variables instead of a two-valued representation. The attribute/object table for conceptual lattices holds fuzzy membership values rather than TRUE/FALSE entries and can be mapped into a graph of dependencies. From this graph implications can be extracted together with the method to compute truth values for the inferi...

متن کامل

Building a Domain Knowledge Model Based on a Concept Lattice Integrating Expert Constraints

Traditionally, FCA can be used as a tool for eliciting from data a class schema in the form of either a set of attribute implications or a concept lattice. However, such a schema does not necessarily fit the point of view of a domain expert for different reasons, e.g. noise, errors or exceptions in the data. For example, in the domain of animals, an expert may expect that the rule “mammal impli...

متن کامل

Axiomatization of Fuzzy Attribute Logic over Complete Residuated Lattices

The paper deals with fuzzy attribute logic (FAL) and shows its completeness over all complete residuated lattices. FAL is a calculus for reasoning with if-then rules describing particular attribute dependencies in objectattribute data. Completeness is proved in two versions: classical-style completeness and graded-style completeness.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004